منابع مشابه
Minimal Degrees for Honest Polynomial Reducibilities
The existence of minimal degrees is investigated for several polynomial reducibilities. It is shown that no set has minimal degree with respect to polynomial many-one or Turing reducibility. This extends a result. of Ladner [L] whew reciirsive sets are considered. An "honest '' polynomial reducibility, < ; , is defined which is a strengthening of polynomial Turing reduc-ibility. We prove that n...
متن کاملOn the structure of honest elementary degrees
We present some new results, and survey some old results, on the structure of honest elementary degrees. This paper should be a suitable first introduction to the honest elementary degrees.
متن کاملThe Collapse of the Polynomial Hierarchy: NP = P
We present a novel extension to the permutation group enumeration technique which is well known to have polynomial time algorithms. This extended technique allows each perfect matching in a bipartite graph of size O(n) to be expressed as a unique directed path in a directed acyclic graph of size O(n). Thus it transforms the perfect matching counting problem into a directed path counting problem...
متن کاملNP=P: From Polynomial Time Approximation Bounded Solutions of TSP
The question of whether all problems in NP class are also in P class is generally considered one of the most important open questions in mathematics and theoretical computer science as it has far-reaching consequences to other problems in mathematics, computer science, biology, philosophy and cryptography. There are intensive research on proving ‘NP not equal to P’ and ‘NP equals to P’. However...
متن کاملMultivariate Polynomial Integration and Derivative Are Polynomial Time Inapproximable unless P=NP
We investigate the complexity of integration and derivative for multivariate polynomials in the standard computation model. The integration is in the unit cube [0, 1] for a multivariate polynomial, which has format f(x1, · · · , xd) = p1(x1, · · · , xd)p2(x1, · · · , xd) · · · pk(x1, · · · , xd), where each pi(x1, · · · , xd) = ∑d j=1 qj(xj) with all single variable polynomials qj(xj) of degree...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1987
ISSN: 0304-3975
DOI: 10.1016/0304-3975(87)90036-3